Distance-regular graphs of q -Racah type and the universal Askey–Wilson algebra

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distance-regular graphs of q-Racah type and the q-tetrahedron algebra

In this paper we discuss a relationship between the following two algebras: (i) the subconstituent algebra T of a distance-regular graph that has q-Racah type; (ii) the q-tetrahedron algebra ⊠q which is a q-deformation of the three-point sl2 loop algebra. Assuming that every irreducible T -module is thin, we display an algebra homomorphism from ⊠q into T and show that T is generated by the imag...

متن کامل

Distance-regular graphs and the q-tetrahedron algebra

Let Γ denote a distance-regular graph with classical parameters (D, b, α, β) and b 6= 1, α = b − 1. The condition on α implies that Γ is formally self-dual. For b = q we use the adjacency matrix and dual adjacency matrix to obtain an action of the q-tetrahedron algebra ⊠q on the standard module of Γ. We describe four algebra homomorphisms into ⊠q from the quantum affine algebra Uq(ŝl2); using t...

متن کامل

On bipartite Q-polynomial distance-regular graphs

Let Γ denote a bipartite Q-polynomial distance-regular graph with vertex set X, diameter d ≥ 3 and valency k ≥ 3. Let RX denote the vector space over R consisting of column vectors with entries in R and rows indexed by X. For z ∈ X, let ẑ denote the vector in RX with a 1 in the z-coordinate, and 0 in all other coordinates. Fix x, y ∈ X such that ∂(x, y) = 2, where ∂ denotes path-length distance...

متن کامل

Distance-regular graphs, pseudo primitive idempotents, and the Terwilliger algebra

Let Γ denote a distance-regular graph with diameter D ≥ 3, intersection numbers ai, bi, ci and Bose-Mesner algebra M. For θ ∈ C ∪∞ we define a 1 dimensional subspace of M which we call M(θ). If θ ∈ C then M(θ) consists of those Y in M such that (A−θI)Y ∈ CAD, where A (resp. AD) is the adjacency matrix (resp. Dth distance matrix) of Γ. If θ = ∞ then M(θ) = CAD. By a pseudo primitive idempotent f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series A

سال: 2014

ISSN: 0097-3165

DOI: 10.1016/j.jcta.2014.03.001